Problems in Sequential and Parallel Game Tree Search
نویسنده
چکیده
The |{ algorithm is an eecient technique for searching game trees. As parallel computers become more available, it is important to have good parallel game tree search algorithms. Until now it is an open problem whether a linear speedup can be achieved with respect to sequential alpha{ beta. This note presents a sample of game trees with distinct leaf values, which are easy for sequential alpha{beta { independent of the move ordering in the trees. We conjecture that these trees are diicult test cases for parallel algorithms.
منابع مشابه
APHID: Asynchronous Parallel Game-Tree Search
Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree, or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. A...
متن کاملSelective Game Tree Search on a Cray T3E
The-algorithm or the Negascout algorithm are known to search game trees eeciently. Many research has been done in the past to increase the speed of the search by adding heuristics. In this paper, we present a distributed algorithm for game tree search. It is based on the Negascout algorithm and a domain independent selective search technique called Fail High Reductions. The main idea of Fail Hi...
متن کاملPerformance Analysis of Two Parallel Game-Tree Search Applications
Game-tree search plays an important role in the field of artificial intelligence. In this paper we analyze scalability performance of two parallel game-tree search applications in chess on two shared-memory multiprocessor systems. One is a recently-proposed Parallel Randomized Best-First Minimax search algorithm (PRBFM) in a chess-playing program, and the other is Crafty, a state-of-the-art alp...
متن کاملSpeculative Parallelism Improves Search
The extreme e ciency of sequential search and the natural tendency of tree prun ing systems to produce wide variations in workload partly explains why it is proving di cult to achieve more than e ciency for massively parallel implementations of the algorithm Here we introduce typical enhanced sequential algorithms and address the major issues of parallel game tree searching under conditions of ...
متن کاملParallel and Concurrent Search for Fast And/or Tree Search Onmulticore Processors
This paper proposes a fast AND/OR tree search algorithm using a multiple paths parallel and concurrent search scheme for embedded multicore processors. Currently, not only PCs or supercomputers but also information appliances such as game consoles, mobile devices and car navigation systems are equipped with multicore processors for better cost performance and lower power consumption. However, t...
متن کامل